Random Generation of Linear Codes
نویسنده
چکیده
Isometry classes of linear codes can be expressed as orbits under the group action of a wreath product. Some combinatorial and algebraic methods are discussed which can be applied for generating linear codes distributed uniformly at random over all isometry classes.
منابع مشابه
On Efficient Decoding and Design of Sparse Random Linear Network Codes
Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A generation-based strategy is employed in which source packets are grouped into overlapping subsets called generations. RLNC is performed only amongst packets ...
متن کاملCode generator matrices as RNG conditioners
We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random variable and the weight distribution of the code. Previously known bounds on the performance of linear binary codes as entropy extractors can be derived by conside...
متن کاملA weight-distribution bound for entropy extractors using linear binary codes
We consider a bound on the bias reduction of a random number generator by processing based on binary linear codes. We introduce a new bound on the total variation distance of the processed output based on the weight distribution of the code generated by the chosen binary matrix. Starting from this result we show a lower bound for the entropy rate of the output of linear binary extractors.
متن کاملRandom linear binary codes have smaller list sizes than uniformly random binary codes
There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \epsilon$ is $(p,O(1/\epsilon))$-list-decodable. In this work, we show that in fact random linear binary codes are \em more \em list-decodable than uniformly random codes, in the sense that the constant in th...
متن کاملPost-Processing Functions for a Biased Physical Random Number Generator
A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing described by M. Dichtl at FSE’07 [4] is introduced. A general formula for non linear corrector, determining the bias and the minimal entropy of the output of a function is given. Finally, a concrete and efficient construction of po...
متن کامل